منابع مشابه
Shortest path problems with node failures
Consider the problem of finding the shortest paths from a node source s to a node sink t in a complete network. On any given instance of the problem, only a subset of the intermediate nodes can be used to go from s to t , the subset being chosen according to a given probability law. We wish to find an a priori path from s to f such that, on any given instance of the problem, the sequence of nod...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملRobust shortest path problems
This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness are presented: those coming from decision theory, those coming from multicriteria analysis and those com...
متن کاملShortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
During the last years, impressive progress has been achieved in the field of algorithm engineering. A problem becoming more and more important is that of data dependency: the performance of an algorithm often highly depends on the input. Yet, for a given input, it is highly non-trivial to select the best solving strategy. In this work, we introduce a new methodology for evaluating speed-up tech...
متن کاملRobust shortest path problems with uncertain costs
Data coming from real-world applications are very often affected by uncertainty. On the other hand, it is difficult to translate uncertainty in terms of combinatorial optimization. In this paper we study a combinatorial optimization model to deal with uncertainty in arc costs in shortest path problems. We consider a model where feasible arc cost scenarios are described via a convex polytope. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1992
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230220607